MapReduce Integrated Multi-algorithm for HPC Running State Analysis

High-performance computer clusters are major seismic processing platforms in the oil industry and have a frequent occurrence of failures. In this study, K-means and the Naive Bayes algorithm were programmed into MapReduce and run on Hadoop. The accumulated high-performance computer cluster running status data were first clustered by K-means, and then the results were used for Naive Bayes training. Finally, the test data were discriminated for the knowledge base and equipment failure. Experiments indicate that K-means returned good results, the Naive Bayes algorithm had a high rate of discrimination, and the multi-algorithm used in MapReduce achieved an intelligent prediction mechanism

Biologically Inspired Intelligence with Applications on Robot Navigation

Biologically inspired intelligence technique, an important embranchment of series on computational intelligence, plays a crucial role for robotics. The autonomous robot and vehicle industry has had an immense impact on our economy and society and this trend will continue with biologically inspired neural network techniques. In this chapter, multiple robots cooperate to achieve a common coverage goal efficiently, which can improve the work capacity, share the coverage tasks, and reduce the completion time by a biologically inspired intelligence technique, is addressed. In many real-world applications, the coverage task has to be completed without any prior knowledge of the environment. In this chapter, a neural dynamics approach is proposed for complete area coverage by multiple robots. A bio-inspired neural network is designed to model the dynamic environment and to guide a team of robots for the coverage task. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting neural equation. Each mobile robot treats the other robots as moving obstacles. Each robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot position. The proposed model algorithm is computationally simple. The feasibility is validated by four simulation studies

Generic Design Methodology for Smart Manufacturing Systems From a Practical Perspective. Part II—Systematic Designs of Smart Manufacturing Systems

In a traditional system paradigm, an enterprise reference model provides the guide for practitioners to select manufacturing elements, configure elements into a manufacturing system, and model system options for evaluation and comparison of system solutions against given performance metrics. However, a smart manufacturing system aims to reconfigure different systems in achieving high-level smartness in its system lifecycle; moreover, each smart system is customized in terms of the constraints of manufacturing resources and the prioritized performance metrics to achieve system smartness. Few works were found on the development of systematic methodologies for the design of smart manufacturing systems. The novel contributions of the presented work are at two aspects: (1) unified definitions of digital functional elements and manufacturing systems have been proposed; they are generalized to have all digitized characteristics and they are customizable to any manufacturing system with specified manufacturing resources and goals of smartness and (2) a systematic design methodology has been proposed; it can serve as the guide for designs of smart manufacturing systems in specified applications. The presented work consists of two separated parts. In the first part of paper, a simplified definition of smart manufacturing (SM) is proposed to unify the diversified expectations and a newly developed concept digital triad (DT-II) is adopted to define a generic reference model to represent essential features of smart manufacturing systems. In the second part of the paper, the axiomatic design theory (ADT) is adopted and expanded as the generic design methodology for design, analysis, and assessment of smart manufacturing systems. Three case studies are reviewed to illustrate the applications of the proposed methodology, and the future research directions towards smart manufacturing are discussed as a summary in the second part

POVNav: A Pareto-Optimal Mapless Visual Navigator

Mapless navigation has emerged as a promising approach for enabling autonomous robots to navigate in environments where pre-existing maps may be inaccurate, outdated, or unavailable. In this work, we propose an image-based local representation of the environment immediately around a robot to parse navigability. We further develop a local planning and control framework, a Pareto-optimal mapless visual navigator (POVNav), to use this representation and enable autonomous navigation in various challenging and real-world environments. In POVNav, we choose a Pareto-optimal sub-goal in the image by evaluating all the navigable pixels, finding a safe visual path, and generating actions to follow the path using visual servo control. In addition to providing collision-free motion, our approach enables selective navigation behavior, such as restricting navigation to select terrain types, by only changing the navigability definition in the local representation. The ability of POVNav to navigate a robot to the goal using only a monocular camera without relying on a map makes it computationally light and easy to implement on various robotic platforms. Real-world experiments in diverse challenging environments, ranging from structured indoor environments to unstructured outdoor environments such as forest trails and roads after a heavy snowfall, using various image segmentation techniques demonstrate the remarkable efficacy of our proposed framework

Generic Design Methodology for Smart Manufacturing Systems from a Practical Perspective, Part I—Digital Triad Concept and Its Application as a System Reference Model

Rapidly developed information technologies (IT) have continuously empowered manufacturing systems and accelerated the evolution of manufacturing system paradigms, and smart manufacturing (SM) has become one of the most promising paradigms. The study of SM has attracted a great deal of attention for researchers in academia and practitioners in industry. However, an obvious fact is that people with different backgrounds have different expectations for SM, and this has led to high diversity, ambiguity, and inconsistency in terms of definitions, reference models, performance matrices, and system design methodologies. It has been found that the state of the art SM research is limited in two aspects: (1) the highly diversified understandings of SM may lead to overlapped, missed, and non-systematic research efforts in advancing the theory and methodologies in the field of SM; (2) few works have been found that focus on the development of generic design methodologies for smart manufacturing systems from the practice perspective. The novelty of this paper consists of two main aspects which are reported in two parts respectively. In the first part, a simplified definition of SM is proposed to unify the existing diversified expectations, and a newly developed concept named digital triad (DT-II) is adopted to define a reference model for SM. The common features of smart manufacturing systems in various applications are identified as functional requirements (FRs) in systems design. To model a system that is capable of reconfiguring itself to adapt to changes, the concept of IoDTT is proposed as a reference model for smart manufacturing systems. In the second part, these two concepts are used to formulate a system design problem, and a generic methodology, based on axiomatic design theory (ADT), is proposed for the design of smart manufacturing systems

Hepatitis C Virus Core-Derived Peptides Inhibit Genotype 1b Viral Genome Replication via Interaction with DDX3X

The protein DDX3X is a DEAD-box RNA helicase that is essential for the hepatitis C virus (HCV) life cycle. The HCV core protein has been shown to bind to DDX3X both in vitro and in vivo. However, the specific interactions between these two proteins and the functional importance of these interactions for the HCV viral life cycle remain unclear. We show that amino acids 16–36 near the N-terminus of the HCV core protein interact specifically with DDX3X both in vitro and in vivo. Replication of HCV replicon NNeo/C-5B RNA (genotype 1b) is significantly suppressed in HuH-7-derived cells expressing green fluorescent protein (GFP) fusions to HCV core protein residues 16–36, but not by GFP fusions to core protein residues 16–35 or 16–34. Notably, the inhibition of HCV replication due to expression of the GFP fusion to HCV core protein residues 16–36 can be reversed by overexpression of DDX3X. These results suggest that the protein interface on DDX3X that binds the HCV core protein is important for replicon maintenance. However, infection of HuH-7 cells by HCV viruses of genotype 2a (JFH1) was not affected by expression of the GFP fusion protein. These results suggest that the role of DDX3X in HCV infection involves aspects of the viral life cycle that vary in importance between HCV genotypes

Novel Convex Optimization Approaches for VLSI Floorplanning

c○Chaomin Luo 2008I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. The floorplanning problem aims to arrange a set of rectangular modules on a rectangular chip area so as to optimize an appropriate measure of performance. This problem is known to be NP-hard, and is particularly challenging if the chip dimensions are fixed. Fixed-outline floorplanning is becoming increasingly important as a tool to design flows in the hierarchical design of Application Specific Integrated Circuits and System-On-Chip. Therefore, it has recently received much attention. A two-stage convex optimization methodology is proposed to solve the fixedoutline floorplanning problem. It is a global optimization problem for wirelength minimization. In the first stage, an attractor-repeller convex optimization model provides the relative positions of the modules on the floorplan. The second stage places and sizes the modules using convex optimization. Given the relative positions of th

A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm

In real-world manufacturing systems, production scheduling systems are often implemented under random or dynamic events like machine failure, unexpected processing times, stochastic arrival of the urgent orders, cancellation of the orders, and so on. These dynamic events will lead the initial scheduling scheme to be nonoptimal and/or infeasible. Hence, appropriate dynamic rescheduling approaches are needed to overcome the dynamic events. In this paper, we propose a dynamic rescheduling method based on variable interval rescheduling strategy (VIRS) to deal with the dynamic flexible job shop scheduling problem considering machine failure, urgent job arrival, and job damage as disruptions. On the other hand, an improved genetic algorithm (GA) is proposed for minimizing makespan. In our improved GA, a mix of random initialization population by combining initialization machine and initialization operation with random initialization is designed for generating high-quality initial population. In addition, the elitist strategy (ES) and improved population diversity strategy (IPDS) are used to avoid falling into the local optimal solution. Experimental results for static and several dynamic events in the FJSP show that our method is feasible and effective